A Hybrid Algorithm for the University Course Timetabling Problems
نویسندگان
چکیده
منابع مشابه
A Hybrid Approach for University Course Timetabling
The university course timetabling problem deals with the assignment of lectures to specific timeslots and rooms. The goal is to satisfy the soft constraints to the largest degree possible while constructing a feasible schedule. In this paper, we present a hybrid approach consisting of three phases. During phase 1, initial solutions are generated using a constructive heuristic. An improvement ap...
متن کاملAn effective hybrid algorithm for university course timetabling
The university course timetabling problem is an optimisation problem in which a set of events has to be scheduled in timeslots and located in suitable rooms. Recently, a set of benchmark instances was introduced and used for an ‘International Timetabling Competition’ to which 24 algorithms were submitted by various research groups active in the field of timetabling. We describe and analyse a hy...
متن کاملKnowledge-based genetic algorithm for university course timetabling problems
This paper discusses a new solution to university course timetabling problems. The problems that belong to the NP-hard class are very difficult to solve using conventional optimization techniques. Our solution methodology is based on a genetic algorithm which uses an installed knowledge base and an infection operation. The knowledge base here is a set of candidate partial solutions of the final...
متن کاملA memetic algorithm for University Course Timetabling
We present here a metaheuristic approach to the university course timetabling problem using a memetic algorithm with a very effective local search. The algorithm was tested on the International Timetabling Competition benchmark instances. Results are encouraging and show that evolutionary computation with the help of local search can compete with succesful algorithms on the problem.
متن کاملGenetic Algorithms for University Course Timetabling Problems
The university course timetabling problem is a difficult optimisation problem due to its highly-constrained nature. Finding an optimal, or even a high quality, timetable is a challenging task, especially when resources (e.g., rooms and time slots) are limited. In the literature, many approaches have been studied to solve this problem. In this thesis, we investigate genetic algorithms to solve t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Japan Society for Fuzzy Theory and Intelligent Informatics
سال: 2010
ISSN: 1881-7203,1347-7986
DOI: 10.3156/jsoft.22.142